Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("SEMANTIQUE DENOTATIONNELLE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 472

  • Page / 19
Export

Selection :

  • and

SUR LES SYSTEMES DE DEFINITIONS RECURSIVES PAR CAS: APPLICATION A LA SEMANTIQUE DENOTATIONNELLE = ON SYSTEMS OF DEFINITIONS RECURSIVE BY CASE: APPLICATION TO DENOTATIONAL SEMANTICSLAVANDIER FRANCOIS.1982; ; FRA; DA. 1982; 89 P.; 30 CM; BIBL. 3 P.; TH. 3E CYCLE: INF./BORDEAUX 1/1982/1737Thesis

THE DENOTATIONAL SEMANTICS OF SEQUENTIAL MACHINESGORDON MJC.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 1; PP. 1-3; BIBL. 2 REF.Article

LEAST FIXED POINTS AND THE RECURSION THEOREM.VAN EMDE BOAS P.1976; STICHTG MATH. CENTRUM, AFD. ZUEWERE WISKDE; NEDERL.; DA. 1976; NO 78; PP. 1-10; BIBL. 11 REF.Serial Issue

A DENOTATIONAL FRAMEWORK FOR DATA FLOW ANALYSISNIELSON F.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 3; PP. 265-287; BIBL. 15 REF.Article

DOMAINS FOR DENOTATIONAL SEMANTICSSCOTT DS.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 577-613; BIBL. 3 P.Conference Paper

EXPERIENCE WITH AN EXPERIMENTAL COMPILER GENERATOR BASED ON DENOTATIONAL SEMANTICSBODWIN J; BRADLEY L; KANDA K et al.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 6; PP. 216-229; BIBL. 2 P.Conference Paper

IN-SCOTT-STARCHY STYLE DENOTATIONAL SEMANTICS, PARALLELISM IMPLIES NONDETERMINISMBENSON DB.1982; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 3; PP. 265-275; BIBL. 16 REF.Article

A POWERDOMAIN FOR COUNTABLE NON-DETERMINISMPLOTKIN GD.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 418-428; BIBL. 16 REF.Conference Paper

CONSISTENT SEMANTICS FOR A DATA FLOW LANGUAGEBROCK JD.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 168-180; BIBL. 13 REF.Conference Paper

EXPERIMENTS IN BLOCK-STRUCTURED GOTO LANGUAGE MODELING EXITS VERSUS CONTINUATIONSBJORNER D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 86; PP. 216-247; BIBL. 21 REF.Conference Paper

MODELS OF PROGRAMMING LANGUAGE CONCEPTSJONES CB.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 86; PP. 100-143; BIBL. 2 P.Conference Paper

A TERM MODEL FOR CCSHENNESSY MCB; PLOTKIN GD.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 261-274; BIBL. 23 REF.Conference Paper

A new category for semanticsSCOTT, Dana S.Lecture notes in computer science. 2001, pp 1-2, issn 0302-9743, isbn 3-540-42496-2Conference Paper

THE CONGRUENCE OF TWO PROGRAMMING LANGUAGE DEFINITIONSSTOY JE.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 2; PP. 151-174; BIBL. 16 REF.Article

THE FORMAL DEFINITION OF A REAL-TIME LANGUAGEHENNESSY JL; KIEBURTZ RB.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 309-345; BIBL. 19 REF.Article

THE SEMANTICS OF CLEAR, A SPECIFICATION LANGUAGEBURSTALL RM; GOGUEN JA.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 86; PP. 292-332; BIBL. 2 P.Conference Paper

FULLY ABSTRACT MODELS OF TYPED LAMBDA -CALCULI.MILNER R.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 1; PP. 1-22; BIBL. 11 REF.Article

LOGIC AND PROGRAMMING LANGUAGES.SCOTT DS.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 9; PP. 634-641; BIBL. 14 REF.Article

CORRECTNESS PROOFS FOR ASSIGNMENT STATEMENTS.DE BAKKER JW.1976; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1976; NO 55; PP. 1-20; BIBL. 6 REF.Serial Issue

FULL ABSTRACTION FOR SEQUENTIAL LANGUAGES: THE STATE OF THE ART = MODELE COMPLETEMENT ADEQUAT DE LANGAGES SEQUENTIELS: L'ETAT DE L'ARTBERRY GERARD; CURIEN PIERRE LOUIS; LEVY JEAN JACQUES et al.1983; ; FRA; PARIS: IMPR. I.N.R.I.A.; DA. 1983; INRIA/RR-197; 43 P.; 30 CM; ABS. FRE; BIBL. 46 REF.;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 197]Report

ON EFFECTIVE COMPUTATIONS OF NON-DETERMINISTIC SCHEMESPOIGNE A.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 313-336; BIBL. 16 REF.Conference Paper

CIRCULAR EXPRESSIONS: ELIMINATION OF STATIC ENVIRONMENTSSETHI R.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 378-392; BIBL. 2 P.Conference Paper

CONSTRUCTING CALL-BY-VALUE CONTINUATION SEMANTICSSETHI R; TANG A.1980; J. ASS. COMPUTG MACHIN; USA; DA. 1980; VOL. 27; NO 3; PP. 580-597; BIBL. 16 REF.Article

ON OBSERVING NONDETERMINISM AND CONCURRENCYHENNESSY M; MILNER R.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 299-309; BIBL. 9 REF.Conference Paper

ON THE FORMAL DEFINITION OF ADADONZEAU GOUGE V; KAHN G; LANG B et al.1980; RIV. INF.; ITA; DA. 1980; VOL. 10; NO 1; PP. 5-14; BIBL. 13 REF.Article

  • Page / 19